304A - Pythagorean Theorem II - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;

ll mod = 1000000007;

ll mod1 = 1073741824;

int d[1000001] = {0};

void solve() {  
    int n;
    cin >> n;
    int cnt = 0;
    for(int a = 1; a <= n; a++) {
        for(int b = a; a*a + b*b <= n*n; b++) {
            int c = sqrt(a*a + b*b);
            if(c*c == a*a + b*b) cnt++;
        } 
    }
    cout << cnt << endl;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case #" << t << ": ";
        solve();
    }
}